What Is a Random String ? Extended
نویسنده
چکیده
Chaitin’s algorithmic definition of random strings—based on the complexity induced by self-delimiting computers—is critically discussed. One shows that Chaitin’s model satisfy many natural requirements related to randomness, so it can be considered as an adequate model for finite random objects. It is a better model than the original (Kolmogorov) proposal. Finally, some open problems will be discussed.
منابع مشابه
DEVELOPMENT IN STRING THEORY
The string theory is a fast moving subject, both physics wise and in the respect of mathematics. In order to keep up with the discipline it is important to move with new ideas which are being stressed. Here I wish to give extracts from new papers of ideas which I have recently found interesting. There are six papers which are involved: I ."Strings formulated directly in 4 dimensions " A. N...
متن کاملElectromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem
In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...
متن کاملاثرات کوانتومی خلأ برای یک ریسمان بوزونی جرمدار در حضور میدان پسزمینه
We study the Casimir effect for a Bosonic string extended between D-branes, and living in a flat space with an antisymmetric background B-field. We find the Casimir energy as a function of the B-field, and the mass-parameter of the string, and accordingly we obtain a B-dependence correction term to the ground-state mass of the string. We show that for sufficiently large B-field, the ground stat...
متن کاملWhat Is a Random String?
then we would tend to believe A and would not believe B: the string u seems to be random, but the string v does not. Further on, if we change the value of a bit (say, from 1 to 0) in a (non) "random" string, then the result is still a (non) "random" string. If we keep making such changes in a "random" string, then we will eventually complete destroy randomness. Laplace [21], pp.16-17 was, in a ...
متن کاملSelf-assembly of strings and languages
Self-assembly is the process in which simple objects autonomously aggregate into large structures and it has become one of the major tools for nano-scale engineering. We propose in this paper a string-based framework inspired by the principle of selfassembly: two strings with a common overlap, say uv and vw, yield a string uvw; we say that string uvw has been assembled from strings uv and vw. T...
متن کامل